Cheaper Adjoints by Reversing Address Computations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cheaper adjoints by reversing address computations

The reverse mode of automatic differentiation is widely used in science and engineering. A severe bottleneck for the performance of the reverse mode, however, is the necessity to recover certain intermediate values of the program in reverse order. Among these values are computed addresses, which traditionally are recovered through forward recomputation and storage in memory. We propose an alter...

متن کامل

Cheaper by the Dozen: Batched Algorithms

While computing power and memory size have been steadily increasing as predicted by Moore’s Law, they are still dwarfed by the size of massive data sets resultant from a number of applications. Many problems arising from astrophysics, computational biology, telecommunications, and the Internet often have an amount of accompanying data in the terabyte range. The analysis of this data by classica...

متن کامل

Enhancing Software Tamper-Resistance via Stealthy Address Computations

A great deal of software is distributed in the form of executable code. The ability to reverse engineer such executables can create opportunities for theft of intellectual property via software piracy, as well as security breaches by allowing attackers to discover vulnerabilities in an application [9]. Techniques such as watermarking and fingerprinting have been developed to discourage piracy [...

متن کامل

On Pseudomodular Matroids and Adjoints on Pseudomodular Matroids and Adjoints

1992 Mathematisches Institut Universitt at zu KK oln Weyertal 86-90 D{5000 KK oln 41 (Lindenthal) Germany Telefon (0221) 470{3937 Telex 8882291 unik d Telefax (0221) 470{5160 Abstract There are two concepts of duality in combinatorial geometry. A set theoretical one, generalizing the structure of two orthocomplementary vector spaces and a lattice theoretical concept of an adjoint, that mimics d...

متن کامل

Programming cheaper dependable systems

Services must be dependable if they are to deliver the benefit that justifies the cost of deploying them. Services must be sufficiently dependable for their purpose, but no more costly than is necessary to achieve that level of dependability. This document describes some work on identifying programming concepts that can be exploited to reduce the cost of dependable systems. This includes both t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Programming

سال: 2008

ISSN: 1058-9244,1875-919X

DOI: 10.1155/2008/375243